Reliable Fault-Tolerant Multi-bus Scheduling Algorithm
نویسندگان
چکیده
منابع مشابه
Reliable Fault-Tolerant Multi-bus Scheduling Algorithm
In this paper, we propose a fault-tolerant scheduling real-time embedded system. This scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on a data fragmentation and passive redundancy, which allow fast fault detection/retransmission and efficient use of buses. This scheduling approa...
متن کاملImproved Fault Tolerant Elastic Scheduling Algorithm (IFESTAL)
The existing fault tolerant models focus on the failure of host. If a host fails, the copies of tasks on this host will fail to finish. At one time instant, at most one host may encounter a failure, that is to say, if the primaries of tasks fail, the backups can always finish successfully before another host fails. Failures can be either transient or permanent, and are independent, affecting on...
متن کاملDynamic Replication of Fault-Tolerant Scheduling Algorithm
In order to reduce the impact on the grid scheduling caused by the resource error, for complex dependent tasks, designed a dynamic replication of fault-tolerant scheduling algorithm (DRFT). This algorithm build task model by applying hypergraph theory, using primary-backup task as backup mode, take the active execution mode combined with the passive execution mode to perform the backup task, se...
متن کاملA Reliable Fault-Tolerant Scheduling Algorithm for Real Time Embedded Systems
In this paper, we propose a fault-tolerant scheduling for realtime embedded systems. Our scheduling algorithm is dedicated to multibus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on a data fragmentation and passive redundancy, which allow fast fault detection/retransmission and efficient use of buses. Our scheduling appro...
متن کاملAnalysis of a Fault-Tolerant Multiprocessor Scheduling Algorithm
Fault tolerance is an important aspect of real-time computer systems, since timing constraints must not be violated. When dealing with multiprocessor systems, fault tolerance becomes an even greater requirement, since there are more components that can fail. In this paper, we present the analysis of a faulttolerant scheduling algorithm for real-time applications on multiprocessors. Our algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12409-9060